Proof: Tree Graphs Have At Least Two End Vertices | Graph Theory